An arithmetic formula for the partition function
نویسندگان
چکیده
منابع مشابه
An Arithmetic Formula for the Partition Function
Although there is a vast literature on the properties of p(n), typically motivated by work of Ramanujan, some of the simplest questions remain open. For example, little is known about p(n) modulo 2 and 3. Most results concerning the congruence properties of p(n) have been proved using properties of (1.1). Theorems typically depend on q-series identities, the theory of modular equations, or the ...
متن کاملAn Explicit Formula for Restricted Partition Function through Bernoulli Polynomials
Explicit expressions for restricted partition function W (s,d) and its quasiperiodic components Wj(s,d ) (called Sylvester waves) for a set of positive integers d = {d1, d2, . . . , dm} are derived. The formulas are represented in a form of a finite sum over Bernoulli polynomials of higher order with periodic coefficients.
متن کاملOn Explicit Formula for Restricted Partition Function
A new recursive procedure of the calculation of a restricted partition function is suggested. An explicit combinatorial formula for the restricted partition function is found based on this procedure.
متن کاملThe partition function in arithmetic progressions
In celebration of G.E. Andrews' 60 th birthday.
متن کاملA formula for the partition function that “counts”
We derive a combinatorial multisum expression for the number D(n, k) of partitions of n with Durfee square of order k. An immediate corollary is therefore a combinatorial formula for p(n), the number of partitions of n. We then study D(n, k) as a quasipolynomial. We consider the natural polynomial approximation D̃(n, k) to the quasipolynomial representation of D(n, k). Numerically, the sum ∑ 1≤k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2007
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-07-08883-1